Topological Indices, Graph Spectra, Entropies, Laplacians, and Matching Polynomials of n-Dimensional Hypercubes

We obtain a large number of degree and distance-based topological indices, graph Laplacian spectra the corresponding polynomials, entropies matching polynomials n-dimensional hypercubes through use Hadamard symmetry recursive dynamic computational techniques. Moreover, computations are used to provide independent numerical values for indices 11- 12-cubes. invoke symmetry-based transforms nD-hypercubes computed results constructed up 23-dimensional hypercubes. The symmetries these constitute hyperoctahedral wreath product groups which also pave way elegant computations. These independently validate exact analytical expressions that we have obtained as well graph, their polynomials. robust programming technique handle computationally intensive generation compute all 6-cube. distance sequence vectors been numerically 108-dimensional cubes frequencies found be in binomial distributions akin n-cubes.